A comparison of generalized linear discriminant analysis algorithms
نویسندگان
چکیده
منابع مشابه
A comparison of generalized linear discriminant analysis algorithms
Linear Discriminant Analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled problems where the number of data samples is smaller than the dimension of data space, it is difficult to apply the LDA due to the singularity of scatter matrices caused by high dimensionality. In order to make the LDA ap...
متن کاملLinear Discriminant Analysis Algorithms
We propose new algorithms for computing linear discriminants to perform data dimensionality reduction from R to R, with p < n. We propose alternatives to the classical Fisher’s Distance criterion, namely, we investigate new criterions based on the: Chernoff-Distance, J-Divergence and Kullback-Leibler Divergence. The optimization problems that emerge of using these alternative criteria are non-c...
متن کاملAlgorithms for Regularized Linear Discriminant Analysis
This paper is focused on regularized versions of classification analysis and their computation for highdimensional data. A variety of regularized classification methods has been proposed and we critically discuss their computational aspects. We formulate several new algorithms for regularized linear discriminant analysis, which exploits a regularized covariance matrix estimator towards a regula...
متن کاملA Multi Linear Discriminant Analysis Method Using a Subtraction Criteria
Linear dimension reduction has been used in different application such as image processing and pattern recognition. All these data folds the original data to vectors and project them to an small dimensions. But in some applications such we may face with data that are not vectors such as image data. Folding the multidimensional data to vectors causes curse of dimensionality and mixed the differe...
متن کاملA nomenclature for linear discriminant algorithms
Statistical machine learning focuses on non-parametric models that learn the minimum necessary to perform the targeted discrimination. For instance, in a binary classification problem, SVMs will only use the examples located within a boundary margin between the two classes to compute the optimal separation. However, one can consider other discrimination settings that use the entirety of the dat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2008
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2007.07.022